A Hybrid Round Robin Scheduling Mechanism for Process Management
نویسندگان
چکیده
منابع مشابه
Round robin scheduling - a survey
This paper presents a comprehensive survey on the literature considering round robin tournaments. The terminology used within the area has been modified over time and today it is highly inconsistent. By presenting a coherent explanation of the various notions we hope that this paper will help to obtain a unified terminology. Furthermore, we outline the contributions presented during the last 30...
متن کاملA Round Robin Scheduling Policy for Ada
Although Ada defines a number of mechanisms for specifying scheduling policies, only one, Fifo Within Priorities is guaranteed to be supported by all implementations of the Real-Time Systems Annex. Many applications have a mixture of real-time and non real-time activities. The natural way of scheduling non real-time activities is by time sharing the processor using Round Robin Scheduling. Curre...
متن کاملLow Power Round-Robin Scheduling
Energy consumption is becoming a crucial issue in the design of digital systems especially when considering portable and embedded systems due to their operational dependency on batteries. Since the processor is a major source of energy consumption, energy-aware scheduling strategies that decrease the CPU speed when possible enable to achieve significant energy savings. In this paper, we study t...
متن کاملScheduling asynchronous round-robin tournaments
We study the problem of scheduling asynchronous round-robin tournaments. We consider three measures of a schedule that concern the quality and fairness of a tournament. We show that the schedule generated by the well-known “circle design” performs well with respect to all three measures when the number of teams is even, but not when the number of teams is odd. We propose a different schedule th...
متن کاملGlobal constraints for round robin tournament scheduling
In the presence of side-constraints and optimization criteria, round robin tournament problems are hard combinatorial problems, commonly tackled with tree search and branch-andbound optimization. Recent results indicate that constraint-based tree search has crucial advantages over integer programming-based tree search for this problem domain by exploiting global constraint propagation algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2020
ISSN: 0975-8887
DOI: 10.5120/ijca2020919851